/*
 * Test some case for control flow
 * to find the oppurtunity to optimize.
 */
int sumint()
{
	const int C = 2;
	int k1806[5] = {70000, 5000, 0, 30, 8};
	int i = -1;
	int sum = 0;
	while (C > 0)
	{
		i = i + 1;
		sum = sum + k1806[i];
		if (i >= 4)
			break;
		else
			continue;
	}
	return sum;
}

double sumhalf(int n)
{
	double x = 1.0;
	double s = 0.0;
	if (true)
	{
		while (75038 > 64520)
		{
			s = s + x;
			x = x / 2.0;
			n = n - 1;
			if (n <= 0)
				break;
			else
				continue;
		}
	}
	else
	{
		// unreachable
		x = 0.5 - 1.5;
		s = x * 2.0;
	}
	return s;
}

int main()
{
	int s;
	double d;
	s = sumint();
	print_int(s);
	s = get_int();
	d = sumhalf(s);
	print_double(d);
	return 0;
}